Mixed state on a sparsely encoded associative memory model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed state in a sparsely encoded associative memory model storing ultrametric patterns

When mixed states are composed of s memory patterns, s types of mixed states, which can become equilibrium states of the model, can be generated. We found that the storage capacity for all mixed states diverged as 1/|f log f | when the s memory patterns were given correlation. We also investigated how the storage capacity of them change on the correlation coefficient between s memory patterns. ...

متن کامل

Capacity and Error Correction Ability of Sparsely Encoded Associative Memory with Forgetting Process

Associative memory model of neural networks can not store items more than its memory capacity. When new items are given one after another, its connection weights should be decayed so that the number of stored items does not exceed the memory capacity (forgetting process). This paper analyzes the sparsely encoded associative memory, and presents the optimal decay rate that maximizes the number o...

متن کامل

Sparsely-connected associative memory models with displaced connectivity

Our work is concerned with finding optimum connection strategies in highperformance associative memory models. Taking inspiration from axonal branching in biological neurons, we impose a displacement of the point of efferent arborisation, so that the output from each node travels a certain distance before branching to connect to other units. This technique is applied to networks constructed wit...

متن کامل

Efficient architectures for sparsely-connected high capacity associative memory models

In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory, a range of architectures is explored in search of optimal connection strategies which maximise pattern-completion performance, while at the same time minimising wiring costs. It is found that architectures in which t...

متن کامل

Iterative retrieval of sparsely coded associative memory patterns

We investigate the pattern completion performance of neural auto-associative memories composed of binary threshold neurons for sparsely coded binary memory patterns. Focussing on iterative retrieval, eeective threshold control strategies are introduced. These are investigated by means of computer simulation experiments and analytical treatment. To evaluate the systems performance we consider th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Biological Cybernetics

سال: 2001

ISSN: 0340-1200,1432-0770

DOI: 10.1007/s004220100263